Aerospace Contrd and Application ›› 2021, Vol. 47 ›› Issue (6): 52-58.doi: 10.3969/j.issn.1674 1579.2021.06.007
Previous Articles Next Articles
Online:
Published:
Supported by:
Abstract: 3D bin packing problem is a combinatorial optimization problem that needs packing a certain number of objects and maximizing the volume utilization under the constraints of volume limit and stability limit. 3D packing problem is a NP hard problem. Heuristic algorithm is usually used to find the best position to place the object. When robot is used for packing, manipulation uncertainties should be handled. For example, the collisions between the manipulator and the surroundings, and the planning errors of the manipulator motion trajectories may make some optimal poses infeasible. Thus, the object can only be dropped from a higher place or placed near the optimal pose. The uncertainties of robot in grasping, recognition and placing also lead to the error between the real object position and the planned one. Therefore, an optimization method for robot 3D packing via pushing is proposed based on deep reinforcement learning. Aiming at minimizing the score of the heuristic algorithm for the positions of objects in the bin, robot can reorganize the positions of placed objects via pushing. Meanwhile, the objects are compressed towards a corner to make more space and improve the volume utilization rate of packing.
Key words: reinforcement learning, deep learning, 3D bin packing, robot push
CLC Number:
ZHANG Haodong, WU Jianhua. Optimization of Robotic Bin Packing via Pushing Based on Algorithm[J].Aerospace Contrd and Application, 2021, 47(6): 52-58.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: http://journal01.magtech.org.cn/Jwk3_kjkzjs/EN/10.3969/j.issn.1674 1579.2021.06.007
http://journal01.magtech.org.cn/Jwk3_kjkzjs/EN/Y2021/V47/I6/52
Cited